|
In number theory, a Frobenius pseudoprime is a pseudoprime that passes a specific probable prime test described by Jon Grantham in a 1998 preprint and published in 2000. It has been studied by other authors for the case of quadratic polynomials. ==Frobenius pseudoprimes w.r.t. quadratic polynomials== Frobenius pseudoprimes are defined with respect to a fixed monic polynomial. The case of a degree-2 (quadratic) polynomial , where is not a square, is common and can be expressed in terms of Lucas sequences and , leading to fast implementations for testing pseudoprimality. A composite number ''n'' is a Frobenius pseudoprime if and only if , : and : where is the Jacobi symbol. Both conditions hold for all primes, hence this constitutes a probable prime test. Condition (1) is the same condition that defines a Lucas pseudoprime, hence every Frobenius pseudoprime is also a Lucas pseudoprime, but because of the additional condition (2), the converse is not true. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Frobenius pseudoprime」の詳細全文を読む スポンサード リンク
|